Value Based Overload Handling of Aperiodic Tasks in Offline Scheduled Real-Time Systems
نویسندگان
چکیده
This paper describes a runtime scheduling method for a mix of off-line scheduled and value based dynamic tasks with a focus on overload situations. We present a formulation of overload handling as a general binary optimisation problem and give an algorithm for solving it. Our method is based on slot shifting [4] to provide for the integration of offline and online scheduling. Dynamic tasks are scheduled according to basic EDF, extended with an algorithm for overload detection and resolution. We include a penalty value for tasks which have been guaranteed but missed their deadline, e.g., due to rejection under overload. The mixed taskset enables designers to choose a tradeoff between predictability and flexibility for each activity in the system individually and to guarantee predictable execution of offline tasks even under overload situations. The algorithm ensures that overload situations are handled efficiently with respect to the values of the dynamic tasks. [3], [2], [8], and [7] discuss overload handling based on earliest deadline first scheduling. [1] presents scheduling scheme calculating priorities dynamically based on value and deadlines. These focus on online scheduling. Our method handles overload situations while guaranteeing the feasible execution of offline scheduled tasks.
منابع مشابه
Online Handling of Firm Aperiodic Tasks in Time Triggered Systems
A number of industrial applications advocate the use of time triggered approaches for reasons of predictability, cost, product reuse, and maintenance. The rigid offline scheduling schemes used for time triggered systems, however, do not provide for flexibility. At runtime, aperiodic tasks can only be included into the unused resources of the offline schedule, supporting neither guarantees nor f...
متن کاملOnline Handling of Hard Aperiodic Tasks in Time Triggered Systems
A number of industrial applications advocate the use of time triggered approaches for reasons of predictability, cost, product reuse, and maintenance. The rigid offline scheduling schemes used for time triggered systems, however, do not provide for flexibility. At runtime, aperiodic tasks can only be included into the unused resources of the offline schedule, supporting neither guarantees nor f...
متن کاملEnhancing Time Triggered Scheduling with Value Based Overload Handling and Task Migration
Time triggered methods provide deterministic behaviour suitable for critical real-time systems. They perform less favourably, however, if the arrival times of some activities are not known in advance, in particular if overload situations have to be anticipated. In many systems, the criticality of only a subset of activities justify the cost associated with the time triggered methods. In this pa...
متن کاملHandling Aperiodic Tasks and Overload in Distributed Off-line Scheduled Real-Time Systems
System designers face many choices when designing a real-time system. They have to decide how to deal with the original requirements imposed on the system, which operating system (OS), OS functionality, and scheduling algorithm. Ideally designers have a lot of freedom when choosing the most suitable configuration for the system. Unfortunately this is not the case in most present day situations....
متن کاملRobust Aperiodic Scheduling Under Dynamic Priority Systems
When hard periodic and f&-m aperiodic tasks are jointly scheduled in the same system, the processor workload can vary according to the arrival times of aperiodic requests. In order to guarantee the schedulability of the periodic task set, in overload conditions some aperiodic tasks must be rejected. In this paper we propose a technique that, in overload conditions, adds robustness to the joint ...
متن کامل